Euclidean Voronoi diagram of 3D balls and its computation via tracing edges
نویسندگان
چکیده
Despite its important applications in various disciplines in science and engineering, the Euclidean Voronoi diagram for spheres, also known as an additively weighted Voronoi diagram, in 3D space has not been studied as much as it deserves. In this paper, we present an algorithm to compute the Euclidean Voronoi diagram for 3D spheres with different radii. The presented algorithm follows Voronoi edges one by one until the construction is completed in O(mn) time in the worst-case, where m is the number of edges in the Voronoi diagram and n is the number of spherical balls. As building blocks, we show that Voronoi edges are conics that can be precisely represented as rational quadratic Bézier curves. We also discuss how to conveniently represent and process Voronoi faces which are hyperboloids of two sheets. q 2005 Elsevier Ltd. All rights reserved.
منابع مشابه
Edge-tracing algorithm for euclidean voronoi diagram of 3d spheres
Despite of many important applications in various disciplines from sciences and engineering, Voronoi diagram for spheres in a 3-dimensional Euclidean distance has not been studied as much as it deserves. In this paper, we present an edge-tracing algorithm to compute the Euclidean Voronoi diagram of 3-dimensional spheres in O( ) in the worst-case, where is the number of edges of Voronoi diagram ...
متن کاملEuclidean proximity and power diagrams
Power diagrams [Aur87] are a useful generalization of Voronoi diagrams in which the sites defining the diagram are not points but balls. They derive their name from the fact that the distance used in their definition is not the standard Euclidean distance, but instead the classical notion of the power of a point with respect to a ball [Cox61]. The advantage of the power distance is that the ‘bi...
متن کاملSeparable Distance Transformation and its Applications
Metric based description and analysis of shapes a fundamental notion in image analysis and processing. Among classical tools, the distance transform (DT) [54, 39] of a binary image I : Zd → {0,1} consists in labeling each point of a digital object E, defined as pixels with value 1 for instance on I, with its shortest distance to the complement of E. In the literature, DT has been widely used as...
متن کاملComputing Connolly surface of a protein via tracking its boundary curves based on Euclidean Voronoi diagram
Given a protein, it is often necessary to study its geometric and physicochemical properties for studying its structure and predicting funtions of a protein. In this case, a connolly surface of a protein plays important roles for these purpose. A protein consists of a set of amino acids and a set of atoms comprise an amino acide. Since an atom can be represented by a hard 3D sphere in van der W...
متن کاملEfficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron
AVNEESH SUD: Efficient Computation of Discrete Voronoi Diagram and Homotopy-Preserving Simplified Medial Axis of a 3D Polyhedron. (Under the direction of Dinesh Manocha.) The Voronoi diagram is a fundamental geometric data structure and has been well studied in computational geometry and related areas. A Voronoi diagram defined using the Euclidean distance metric is also closely related to the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer-Aided Design
دوره 37 شماره
صفحات -
تاریخ انتشار 2005